Learning to Partition using Score Based Compatibilities
نویسندگان
چکیده
We study the problem of learning to partition users into groups, where one must learn the compatibilities between the users to achieve optimal groupings. We define four natural objectives that optimize for average and worst case compatibilities and propose new algorithms for adaptively learning optimal groupings. When we do not impose any structure on the compatibilities, we show that the group formation objectives considered are NP hard to solve and we either give approximation guarantees or prove inapproximability results. We then introduce an elegant structure, namely that of intrinsic scores, that makes many of these problems polynomial time solvable. We explicitly characterize the optimal groupings under this structure and show that the optimal solutions are related to homophilous and heterophilous partitions, well-studied in the psychology literature. For one of the four objectives, we show NP hardness under the score structure and give a 12 approximation algorithm for which no constant approximation was known thus far. Finally, under the score structure, we propose an online low sample complexity PAC algorithm for learning the optimal partition. We demonstrate the efficacy of the proposed algorithm on synthetic and real world datasets.
منابع مشابه
High-Dimensional Unsupervised Active Learning Method
In this work, a hierarchical ensemble of projected clustering algorithm for high-dimensional data is proposed. The basic concept of the algorithm is based on the active learning method (ALM) which is a fuzzy learning scheme, inspired by some behavioral features of human brain functionality. High-dimensional unsupervised active learning method (HUALM) is a clustering algorithm which blurs the da...
متن کاملLearning Field Compatibilities to Extract Database Records from Unstructured Text
Named-entity recognition systems extract entities such as people, organizations, and locations from unstructured text. Rather than extract these mentions in isolation, this paper presents a record extraction system that assembles mentions into records (i.e. database tuples). We construct a probabilistic model of the compatibility between field values, then employ graph partitioning algorithms t...
متن کاملProblem Based Learning: An Experience of a New Educational Method in Dentistry
Introduction: Considering the necessity of dentistry students' involvement in learning treatment topics and, in order to achieve deeper learning, this study was performed to evaluate problem based learning method and compare it to traditional method of teaching orthodontics to dentistry students. Methods: This interventional study was performed on 64, fifth year dentistry students in 2007-200...
متن کاملCompatibilities for Boundary Extraction
The work presents a methodology contributing to boundary extraction in images of approximate polyhedral objects. We make extensive use of basic principles underlying the process of image formation and thus reduce the role of object-specific knowledge. Simple configurations of line segments are extracted subject to geometric-photometric compatibilities. The perceptual organization into polygonal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017